A novel use of t-packings to construct d-disjunct matrices

نویسندگان

Hung-Lin Fu

Frank K. Hwang

چکیده

A t-packing is an ordered pair (V ,P) where V is a v-set and P is a collection of k-subsets (blocks) of V such that each t-subset of V occurs in at most one block of P. If each t-subset of V occurs in exactly one block of P, then (V ,P) is known as a Steiner (t, k, v)-design. In this paper, we explore a novel use of t-packings to construct d-disjunct matrices. © 2006 Elsevier B.V. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Error-correcting nonadaptive group de-disjunct matrices

d-disjunct matrices constitute a basis for nonadaptive group testing (NGT) algorithms and binary d-superimposed codes. The rows of a d-disjunct matrix represent the tests in a NGT algorithm which identifies up to d defects in a population. The columns of a d-disjunct matrix represent binary d-superimposable codewords. A d-disjunct matrix p is called #-disjunct if given any d + 1 columns of p wi...

متن کامل

Efficiently Decodable Error-Correcting List Disjunct Matrices and Applications

A (d, `)-list disjunct matrix is a non-adaptive group testing primitive which, given a set of items with at most d “defectives,” outputs a superset of the defectives containing less than ` non-defective items. The primitive has found many applications as stand alone objects and as building blocks in the construction of other combinatorial objects. This paper studies error-tolerant list disjunct...

متن کامل

Efficiently Decodable Error-Correcting List Disjunct Matrices and Applications - (Extended Abstract)

A (d, )-list disjunct matrix is a non-adaptive group testing primitive which, given a set of items with at most d “defectives,” outputs a superset of the defectives containing less than non-defective items. The primitive has found many applications as stand alone objects and as building blocks in the construction of other combinatorial objects. This paper studies error-tolerant list disjunct ma...

متن کامل

ar X iv : 1 11 1 . 50 03 v 2 [ cs . IT ] 24 A pr 2 01 2 CONSTRUCTION OF ALMOST DISJUNCT MATRICES FOR GROUP TESTING

In a group testing scheme, a set of tests is designed to identify a small number t of defective items among a large set (of size N ) of items. In the non-adaptive scenario the set of tests has to be designed in one-shot. In this setting, designing a testing scheme is equivalent to the construction of a disjunct matrix, an M × N matrix where the union of supports of any t columns does not contai...

متن کامل